Search results for "Projective plane"
showing 10 items of 27 documents
A class of unitals of order q which can be embedded in two different planes of order q2
1987
By deriving the desarguesian plane of order q2 for every prime power q a unital of order q is constructed which can be embedded in both the Hall plane and the dual of the Hall plane of order q2 which are non-isomorphic projective planes. The representation of translation planes in the fourdimensional projective space of J. Andre and F. Buekenhouts construction of unitals in these planes are used. It is shown that the full automorphism groups of these unitals are just the collineation groups inherited from the classical unitals.
Area minimizing projective planes on the projective space of dimension 3 with the Berger metric
2016
Abstract We show that, among the projective planes embedded into the real projective space R P 3 endowed with the Berger metric, those of least area are exactly the ones obtained by projection of the equatorial spheres of S 3 . This result generalizes a classical result for the projective spaces with the standard metric.
An optimal bound for embedding linear spaces into projective planes
1988
Abstract Linear spaces with υ >n 2 − 1 2 n + 1 points, b⩽n2 + n + 1 lines and not constant point degree are classified. It turns out that there is essentially one class of such linear spaces which are not near pencils and which can not be embedded into any projective plane of order n.
Partial spreads in finite projective spaces and partial designs
1975
A partial t-spread of a projective space P is a collection 5 p of t-dimensional subspaces of P of the same order with the property that any point of P is contained in at most one element of 50. A partial t-spread 5 p of P is said to be a t-spread if each point of P is contained in an element of 5P; a partial t-spread which is not a spread will be called strictly partial. Partial t-spreads are frequently used for constructions of affine planes, nets, and Sperner spaces (see for instance Bruck and Bose [5], Barlotti and Cofman [2]). The extension of nets to affine planes is related to the following problem: When can a partial t-spread 5 ~ of a projective space P be embedded into a larger part…
Zur Hyperebenenalgebraisierung in desargues-Schen projektiven Verbandsgeometrien
1991
As a completion and extension of a result of A. Day and D. Pickering [5] we obtain the following structure theorem in the conceptual frame of projective lattice geometries: In a Desarguesian projective geometry the subgeometry of every at least one-dimensional hyperplane is module induced.
Elementarteiler von Inzidenzmatrizen symmetrischer Blockpläne
1986
By a study of the integral code generated by the rows of the incidence matrix and its extention the following results are obtained: Let d 1,...,d V(d 1|d 2,d 2|d 3...) be the elementary divisors of the incidence matrix of a symmetric (v,n+λ, λ) design. Then d v=(n+λ)n/g.c.d. (n, λ). Moreover, if p is a prime such that p|n, p∤λ and if x p denotes the p-part of x, then (d idv+2−i) p =n p for 2≤i≤v. For projective planes it can be shown that d 1=···=d 3n−2=1, hence $$d_{n^2 - 2n{\text{ }} + {\text{ }}5} {\text{ }} = \cdots = d_{n^2 + n} = n$$ and $$d_{n^2 - n{\text{ }} + {\text{ }}1} = (n + 1)n$$ . The paper also contains some results about elementary divisors of incidence matrices G satisfyin…
Structured Frequency Algorithms
2015
B.A. Trakhtenbrot proved that in frequency computability (introduced by G. Rose) it is crucially important whether the frequency exceeds \(\frac{1}{2}\). If it does then only recursive sets are frequency-computable. If the frequency does not exceed \(\frac{1}{2}\) then a continuum of sets is frequency-computable. Similar results for finite automata were proved by E.B. Kinber and H. Austinat et al. We generalize the notion of frequency computability demanding a specific structure for the correct answers. We show that if this structure is described in terms of finite projective planes then even a frequency \(O(\frac{\sqrt{n}}{n})\) ensures recursivity of the computable set. We also show that …
On t-covers in finite projective spaces
1979
A t-cover of the finite projective space PG(d,q) is a setS of t-dimensional subspaces such that any point of PG(d,q) is contained in at least one element ofS. In Theorem 1 a lower bound for the cardinality of a t-coverS in PG(d,q) is obtained and in Theorem 2 it is shown that this bound is best possible for all positive integers t,d and for any prime-power q.
INCIDENCE CONSTRAINTS: A COMBINATORIAL APPROACH
2006
The simplest geometric constraints are incidences between points and lines in the projective plane. This problem is universal, in the sense that all algebraic systems reduce to such geometric constraints. Detecting incidence dependences between these geometric constraints is NP-complete. New methods to prove incidence theorems are proposed, which use strictly no computer algebra but only combinatorial arguments.
Embedding finite linear spaces in projective planes, II
1987
Abstract It is shown that a finite linear space with maximal point degree n + 1 can be embedded in a projective plane of order n, provided that the line sizes are big enough.